27 research outputs found
Weakly distributive categories
AbstractThere are many situations in logic, theoretical computer science, and category theory where two binary operations — one thought of as a (tensor) “product”, the other a “sum” — play a key role. In distributive and ∗-autonomous categories these operations can be regarded as, respectively, the and/or of traditional logic and the times/par of (multiplicative) linear logic. In the latter logic, however, the distributivity of product over sum is conspicuously absent: this paper studies a “linearization” of that distributivity which is present in both case. Furthermore, we show that this weak distributivity is precisely what is needed to model Gentzen's cut rule (in the absence of other structural rules) and can be strengthened in two natural ways to generate full distributivity and ∗-autonomous categories
Natural deduction and coherence for weakly distributive categories
AbstractThis paper examines coherence for certain monoidal categories using techniques coming from the proof theory of linear logic, in particular making heavy use of the graphical techniques of proof nets. We define a two sided notion of proof net, suitable for categories like weakly distributive categories which have the two-tensor structure (times/par) of linear logic, but lack a negation operator. Representing morphisms in weakly distributive categories as such nets, we derive a coherence theorem for such categories. As part of this process, we develop a theory of expansion-reduction systems with equalities and a term calculus for proof nets, each of which is of independent interest. In the symmetric case the expansion-reduction system on the term calculus yields a decision procedure for the equality of maps for free weakly distributive categories.The main results of this paper are these. First we have proved coherence for the full theory of weakly distributive categories, extending similar results for monoidal categories to include the treatment of the tensor units. Second, we extend these coherence results to the full theory of ∗-autonomous categories — providing a decision procedure for the maps of free symmetric ∗-autonomous categories. Third, we derive a conservative extension result for the passage from weakly distributive categories to ∗-autonomous categories. We show strong categorical conservativity, in the sense that the unit of the adjunction between weakly distributive and ∗-autonomous categories is fully faithful
Homotopy Theoretic Models of Type Theory
We introduce the notion of a logical model category which is a Quillen model
category satisfying some additional conditions. Those conditions provide enough
expressive power that one can soundly interpret dependent products and sums in
it. On the other hand, those conditions are easy to check and provide a wide
class of models some of which are listed in the paper.Comment: Corrected version of the published articl
Linear Logic, -Autonomous Categories and Cofree Coalgebras
. A brief outline of the categorical characterisation of Girard's linear logic is given, analagous to the relationship between cartesian closed categories and typed -calculus. The linear structure amounts to a -autonomous category: a closed symmetric monoidal category G with finite products and a closed involution. Girard's exponential operator, ! , is a cotriple on G which carries the canonical comonoid structure on A with respect to cartesian product to a comonoid structure on !A with respect to tensor product. This makes the Kleisli category for ! cartesian closed. 0. INTRODUCTION. In "Linear logic" [1987], Jean-Yves Girard introduced a logical system he described as "a logic behind logic". Linear logic was a consequence of his analysis of the structure of qualitative domains (Girard [1986]): he noticed that the interpretation of the usual conditional ")" could be decomposed into two more primitive notions, a linear conditional "\Gammaffi" and a unary operator "!" (called "of cours..